Sparse Signal Sampling using Noisy Linear Projections
نویسنده
چکیده
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission.
منابع مشابه
Signal sparsity estimation from compressive noisy projections via γ-sparsified random matrices
In this paper, we propose a method for estimating the sparsity of a signal from its noisy linear projections without recovering it. The method exploits the property that linear projections acquired using a sparse sensing matrix are distributed according to a mixture distribution whose parameters depend on the signal sparsity. Due to the complexity of the exact mixture model, we introduce an app...
متن کاملA new condition for stable recovery of sparse signals from noisy measurements
The null space property and the restricted isometry property for a measurement matrix are two basic properties in compressive sampling, and are closely related to the sparse approximation. In this paper, we introduce the sparse approximation property of order s for a measurement matrix A: ‖xs‖2 ≤ D‖Ax‖2 + β σs(x) √ s for all x, where xs is the best s-sparse approximation of the vector x in `, σ...
متن کاملCompressed Sensing to Power Quality Signal with Orthogonal Matching Pursuit Method
Compressed sensing is a new data compression method which can recover a sparse or compressible signal from a small number of linear and non-adaptive measurements. To solve the problems of high sampling rate and massive data storage faced by traditional collection and compression methods of power quality, compressed sensing algorithm is used in the paper. Gaussian random measurement matrix is us...
متن کاملInformative Sensing
Compressed sensing is a recent set of mathematical results showing that sparse signals can be exactly reconstructed from a small number of linear measurements. Interestingly, for ideal sparse signals with no measurement noise, random measurements allow perfect reconstruction while measurements based on principal component analysis (PCA) or independent component analysis (ICA) do not. At the sam...
متن کاملThresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements
In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random projection; and output noise, where noise enters after the random projection. Sign pattern recovery involves the estimation of sign pattern of a sparse signal. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008